CHASTE: incorporating a novel multi-scale spatial and temporal algorithm into a large-scale open source library.

نویسندگان

  • Miguel O Bernabeu
  • Rafel Bordas
  • Pras Pathmanathan
  • Joe Pitt-Francis
  • Jonathan Cooper
  • Alan Garny
  • David J Gavaghan
  • Blanca Rodriguez
  • James A Southern
  • Jonathan P Whiteley
چکیده

Recent work has described the software engineering and computational infrastructure that has been set up as part of the Cancer, Heart and Soft Tissue Environment (CHASTE) project. CHASTE is an open source software package that currently has heart and cancer modelling functionality. This software has been written using a programming paradigm imported from the commercial sector and has resulted in a code that has been subject to a far more rigorous testing procedure than that is usual in this field. In this paper, we explain how new functionality may be incorporated into CHASTE. Whiteley has developed a numerical algorithm for solving the bidomain equations that uses the multi-scale (MS) nature of the physiology modelled to enhance computational efficiency. Using a simple geometry in two dimensions and a purpose-built code, this algorithm was reported to give an increase in computational efficiency of more than two orders of magnitude. In this paper, we begin by reviewing numerical methods currently in use for solving the bidomain equations, explaining how these methods may be developed to use the MS algorithm discussed above. We then demonstrate the use of this algorithm within the CHASTE framework for solving the monodomain and bidomain equations in a three-dimensional realistic heart geometry. Finally, we discuss how CHASTE may be developed to include new physiological functionality--such as modelling a beating heart and fluid flow in the heart--and how new algorithms aimed at increasing the efficiency of the code may be incorporated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

Optimal Design of FPI^λ D^μ based Stabilizers in Hybrid Multi-Machine Power System Using GWO ‎Algorithm

In this paper, the theory and modeling of large scale photovoltaic (PV) in the power grid and its effect on power system stability are studied. In this work, the basic module, small signal modeling and mathematical analysis of the large scale PV jointed multi-machine are demonstrated. The principal portion of the paper is to reduce the low frequency fluctuations by tuned stabilizer in the atten...

متن کامل

A PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows

Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...

متن کامل

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

A Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty

This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Philosophical transactions. Series A, Mathematical, physical, and engineering sciences

دوره 367 1895  شماره 

صفحات  -

تاریخ انتشار 2009